Aligning Two Fragmented Sequences
نویسندگان
چکیده
Upon completion of the human and mouse genome sequences, world-wide sequencing capacity will turn to other complex organisms. Current strategies call for many of these genomes to be incompletely sequenced. That is, holes will remain in the known sequence, and the relative order and orientation of the known sequence fragments may not be determined. Sequence comparison between two genomes of this sort may allow some of the fragments to be oriented and ordered relative to each other by computational means. We formalize this as an optimization problem, show that the problem is MAX-SNP hard, and develop a polynomial time algorithm that is guaranteed to produce a solution whose score is within a factor 3 of optimal. ? 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
GS-Aligner: a novel tool for aligning genomic sequences using bit-level operations.
A novel algorithm, GS-Aligner, that uses bit-level operations was developed for aligning genomic sequences. GS-Aligner is efficient in terms of both time and space for aligning two very long genomic sequences and for identifying genomic rearrangements such as translocations and inversions. It is suitable for aligning fairly divergent sequences such as human and mouse genomic sequences. It consi...
متن کاملOptimal Alignment of Multiple Sequence Alignments
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 CHAPTER 1: INTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . . . 14 1.1 Perspective . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 1.2 Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 1.3 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملOWEN: aligning long collinear regions of genomes
OWEN is an interactive tool for aligning two long DNA sequences that represents similarity between them by a chain of collinear local similarities. OWEN employs several methods for constructing and editing local similarities and for resolving conflicts between them. Alignments of sequences of lengths over 10(6) can often be produced in minutes. OWEN requires memory below 20 L, where L is the su...
متن کاملA Class Note on Space-Saving Strategies
Straightforward implementation of the dynamic-programming algorithms utilizes quadratic space to produce an optimal global or local alignment. For analysis of long DNA sequences, this space restriction is more crucial than the time constraint. Because of this, different methods have been proposed to reduce the space used for aligning globally or locally two sequences. We first describe a space-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 127 شماره
صفحات -
تاریخ انتشار 2002